On self-reducibility and weak P-selectivityKER-I KO.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 209-221, issn 0022-0000Article

Optimal enclosing regions in planar graphsBIENSTOCK, D; MONMA, C. L.Networks (New York, NY). 1989, Vol 19, Num 1, pp 79-94, issn 0028-3045, 16 p.Article

The complexity of incremental convex hull algorithms in R^dKALLAY, M.Information processing letters. 1984, Vol 19, Num 4, issn 0020-0190, 197Article

Finding hamiltonian circuits in proper interval graphsBERTOSSI, A. A.Information processing letters. 1983, Vol 17, Num 2, pp 97-101, issn 0020-0190Article

Revisiting a result of KoCINTIOLI, P; SILVESTRI, R.Information processing letters. 1997, Vol 61, Num 4, pp 189-194, issn 0020-0190Article

A note on the complexity of an algorithm for Chebyshev approximationGOLDSTEIN, A. A.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 4, pp 503-509, issn 0006-3835Article

The NP-completeness column: an ongoing guideJOHNSON, D. S.Journal of algorithms (Print). 1983, Vol 4, Num 3, pp 286-300, issn 0196-6774Article

Incremental condition estimationBISCHOF, C. H.SIAM journal on matrix analysis and applications. 1990, Vol 11, Num 2, pp 312-322, issn 0895-4798, 11 p.Article

Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fieldsFITCHAS, N; GALLIGO, A; MORGENSTERN, J et al.Journal of pure and applied algebra. 1990, Vol 67, Num 1, pp 1-14, issn 0022-4049, 14 p.Article

Parallel algorithms for cographs and parity graphs wirth applicationsADHAR, G. S; PENG, S.Journal of algorithms (Print). 1990, Vol 11, Num 2, pp 252-284, issn 0196-6774, 33 p.Article

Lower bounds for ShellsortPLAXTON, C. G; SUEL, T.Journal of algorithms (Print). 1997, Vol 23, Num 2, pp 221-240, issn 0196-6774Article

Arboricity and bipartite subgraph listing algorithmsEPPSTEIN, D.Information processing letters. 1994, Vol 51, Num 4, pp 207-211, issn 0020-0190Article

An O(n^1.5) algforithm to color proper circular arcsWEI-KUAN SHIH; WEN-LIAN HSU.Discrete applied mathematics. 1989, Vol 25, Num 3, pp 321-323, issn 0166-218X, 3 p.Article

An algorithm for polynomial multiplication that does not depent on the ring constantsKAMINSKI, M.Journal of algorithms (Print). 1988, Vol 9, Num 1, pp 137-147, issn 0196-6774Article

A strongly polynomial minimum cost circulation algorithmTARDOS, E.Combinatorica (Print). 1986, Vol 5, Num 3, pp 147-255, issn 0209-9683Article

Efficient evaluation of oversampled functionsNATTERER, F.Journal of computational and applied mathematics. 1986, Vol 14, Num 3, pp 303-309, issn 0377-0427Article

The cyclic coloring problem and estimation of sparse Hessian matricesCOLEMAN, T. F; JIN-YI CAI.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 2, pp 221-235, issn 0196-5212Article

A historical note on convex hull finding algorithmsTOUSSAINT, G. T.Pattern recognition letters. 1985, Vol 3, Num 1, pp 21-28, issn 0167-8655Article

A parallel algorithm for the monadic unification problemAUGER, I. E; KRISHNAMOORTHY, M. S.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 2, pp 302-306, issn 0006-3835Article

Computing largest empty circles with location constraintsTOUSSAINT, G. T.International journal of computer & information sciences. 1983, Vol 12, Num 5, pp 347-358, issn 0091-7036Article

On the complexity of general graph factor problemsKIRKPATRICK, D. G; HELL, P.SIAM journal on computing (Print). 1983, Vol 12, Num 3, pp 601-609, issn 0097-5397Article

SNPs problems, complexity, and algorithmsLANCIA, Giuseppe; BAFNA, Vineet; ISTRAIL, Sorin et al.Lecture notes in computer science. 2001, pp 182-193, issn 0302-9743, isbn 3-540-42493-8Conference Paper

On the correctness of linear closure in a class of estimation algorithmsKURKINA, M. V.Computational mathematics and mathematical physics. 1999, Vol 39, Num 4, pp 668-673, issn 0965-5425Article

A simple, efficient algorithm for maximum finding on ringsHIGHAM, L; PRZYTYCKA, T.Information processing letters. 1996, Vol 58, Num 6, pp 319-324, issn 0020-0190Article

A simple modification of Xunrang and Yuzhang's HEAPSORT variant improving its complexity significantlyWEGENER, I.Computer journal (Print). 1993, Vol 36, Num 3, pp 286-288, issn 0010-4620Article